automorphic graph - определение. Что такое automorphic graph
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:     

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое automorphic graph - определение

GENERALIZATION OF PERIODIC FUNCTIONS TO HAVE GROUP DOMAINS
Automorphic cuspidal representation; Automorphic representation; Automorphic forms; Automorphic representations; Automorphy; Fuchsian function

Null graph         
GRAPH WITHOUT EDGES (ON ANY NUMBER OF VERTICES)
Empty tree; Empty graph; Null Graph; Null tree; Singleton graph; Edgeless graph; Order-zero graph
In the mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes called an "empty graph").
Turán graph         
  • The [[octahedron]], a 3-[[cross polytope]] whose edges and vertices form ''K''<sub>2,2,2</sub>, a Turán graph ''T''(6,3). Unconnected vertices are given the same color in this face-centered projection.
GRAPH
Turan graph; Cocktail party graph; Octahedral Graph; Octahedral graph
The Turán graph, denoted by T(n,r), is a complete multipartite graph; it is formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and then connecting two vertices by an edge if and only if they belong to different subsets. Where q and s are the quotient and remainder of dividing n by r (so n = qr + s), the graph is of the form K_{q+1, q+1, \ldots, q, q}, and the number of edges is
Dense graph         
GRAPH IN WHICH THE NUMBER OF EDGES IS CLOSE TO THE MAXIMUM FOR ITS NUMBER OF VERTICES
Sparse graph; Graph density; Density (graph theory)
In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges (where every pair of vertices is connected by one edge). The opposite, a graph with only a few edges, is a sparse graph.

Википедия

Automorphic form

In harmonic analysis and number theory, an automorphic form is a well-behaved function from a topological group G to the complex numbers (or complex vector space) which is invariant under the action of a discrete subgroup Γ G {\displaystyle \Gamma \subset G} of the topological group. Automorphic forms are a generalization of the idea of periodic functions in Euclidean space to general topological groups.

Modular forms are holomorphic automorphic forms defined over the groups SL(2, R) or PSL(2, R) with the discrete subgroup being the modular group, or one of its congruence subgroups; in this sense the theory of automorphic forms is an extension of the theory of modular forms. More generally, one can use the adelic approach as a way of dealing with the whole family of congruence subgroups at once. From this point of view, an automorphic form over the group G(AF), for an algebraic group G and an algebraic number field F, is a complex-valued function on G(AF) that is left invariant under G(F) and satisfies certain smoothness and growth conditions.

Poincaré first discovered automorphic forms as generalizations of trigonometric and elliptic functions. Through the Langlands conjectures automorphic forms play an important role in modern number theory.